Static Optimality and Dynamic Search-Optimality in Lists and Trees
ثبت نشده
چکیده
منابع مشابه
Static Optimality and Dynamic Search-Optimality in Lists and Trees1
Adaptive data structures form a central topic of on-line algorithms research. The area of Competitive Analysis began with the results of Sleator and Tarjan showing that splay trees achieve static optimality for search trees, and that Move-to-Front is constant competitive for the list update problem [ST1], [ST2]. In a parallel development, powerful algorithms have been developed in Machine Learn...
متن کاملOn Performance Deviation of Binary Search Tree Searches from the Optimal Search Tree Search Structures
Binary Search Trees are a frequently used data structure for rapid access to the stored data. Data structures like arrays, vectors and linked lists are limited by the trade-off between the ability to perform a fast search and resize easily. They are an alternative that is both dynamic in size and easily searchable. Due to efficiency reason, complete and nearly complete binary search trees are o...
متن کاملA Study on Splay Trees
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.
متن کاملMulti-Splay Trees
In this thesis, we introduce a new binary search tree data structure called multi-splay tree and prove that multi-splay trees have most of the useful properties different binary search trees (BSTs) have. First, we demonstrate a close variant of the splay tree access lemma [ST85] for multi-splay trees, a lemma that implies multi-splay trees have the O(log n) runtime property, the static finger p...
متن کاملDynamic Optimality - Almost
We present an O(lg lgn)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lgn). This is the first major progress on Sleator and Tarjan’s dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002